Finite-connectivity systems as error-correcting codes
نویسندگان
چکیده
منابع مشابه
Finite-connectivity systems as error-correcting codes.
We investigate the performance of parity check codes using the mapping onto Ising spin systems proposed by Sourlas [Nature (London) 339, 693 (1989); Europhys. Lett. 25, 159 (1994)]. We study codes where each parity check comprises products of K bits selected from the original digital message with exactly C checks per message bit. We show, using the replica method, that these codes saturate Shan...
متن کاملSolving underdetermined systems with error-correcting codes
In an underdetermined system of equations Ax = y, where A is an m × n matrix, only u of the entries of y with u < m are known. Thus Ejw, called ‘measurements’, are known for certain j ∈ J ⊂ {0, 1, . . . ,m−1} where {Ei, i = 0, 1, . . . ,m−1} are the rows of A and |J | = u. It is required, if possible, to solve the system uniquely when x has at most t non-zero entries with u ≥ 2t. Here such syst...
متن کاملVoting Rules As Error-Correcting Codes
We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as error-correcting codes: their goal is to correct errors in the input rankings and recover a ranking that is close to the ground truth. We derive worst-case bounds on the relation between the average accuracy of the input votes, and the accuracy of the output ranking. Empirical res...
متن کاملGroup Homomorphisms as Error Correcting Codes
We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups G and H. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products. Our main result is a general formula for the distance when G is solvable or H is nilpotent, i...
متن کاملMLL proof nets as error-correcting codes
Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. In this paper we propose a novel approach for analyzing proof nets of Multiplicative Linear Logic (MLL) by coding theory. We define families of proof structures and introduce a metric space fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1999
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.60.5352